A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem
نویسندگان
چکیده
منابع مشابه
preventive maintenance scheduling with integer programming and constraint programming
preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملA Constraint Logic Programming Approach to the Crew Rostering Problem
In this paper, we present a constraint based approach to the Crew Rostering Problem. A solution to this problem is the optimal sequencing of a given set of duties into rosters in order to satisfy a set of constraints. The optimality criterion concerns the minimization of the number of crews needed to cover the duties. This kind of problem has been traditionally solved with Operations Research (...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملHybrid Approach of Constraint Programming and Integer Programming for Solving Resource - constrained Project - scheduling Problems
Abstract—Resource –constrained project scheduling problem (RCPSP) is a well known NP hard problem. This paper proposes a hybrid approach of constraint programming (CP) and integer programming (IP) which could solve RCPSP with ideal efficiency and quality. Constraint propagation is key element of constraint programming and is widely used in cumulative resource problem (CRP). CRP can be taken as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.08.033